Extensions of barrier sets to nonzero roots of the matching polynomial

نویسندگان

  • Cheng Yeaw Ku
  • Kok Bin Wong
چکیده

In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to its connection to maximum matchings in a graph. In this paper, we first define θ-barrier sets. Our definition of a θ-barrier set is slightly different from that of a barrier set. However we show that θ-barrier sets and barrier sets have similar properties. In particular, we prove a generalized Berge’s Formula and give a characterization for the set of all θ-special vertices in a graph. keywords: matching polynomial, Gallai-Edmonds Decomposition, barrier sets, extreme sets

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the maximal ideal space of extended polynomial and rational uniform algebras

Let K and X be compact plane sets such that K X. Let P(K)be the uniform closure of polynomials on K. Let R(K) be the closure of rationalfunctions K with poles o K. Dene P(X;K) and R(X;K) to be the uniformalgebras of functions in C(X) whose restriction to K belongs to P(K) and R(K),respectively. Let CZ(X;K) be the Banach algebra of functions f in C(X) suchthat fjK = 0. In this paper, we show th...

متن کامل

Carlitz Extensions

The ring Z has many analogies with the ring Fp[T ], where Fp is a field of prime size p. For example, for nonzero m ∈ Z and nonzero M ∈ Fp[T ], the residue rings Z/(m) and Fp[T ]/M are both finite. The unit groups Z × = {±1} and Fp[T ]× = Fp are both finite. Every nonzero integer can be made positive after multiplication by a suitable unit, and every nonzero polynomial in Fp[T ] can be made mon...

متن کامل

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

On constant products of elements in skew polynomial rings

Let $R$ be a reversible ring which is $alpha$-compatible for an endomorphism $alpha$ of $R$ and $f(X)=a_0+a_1X+cdots+a_nX^n$ be a nonzero skew polynomial in $R[X;alpha]$. It is proved that if there exists a nonzero skew polynomial $g(X)=b_0+b_1X+cdots+b_mX^m$ in $R[X;alpha]$ such that $g(X)f(X)=c$ is a constant in $R$, then $b_0a_0=c$ and there exist nonzero elements $a$ and $r$ in $R$ such tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2010